Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey

نویسندگان

  • Jiguo Yu
  • Nannan Wang
  • Guanghui Wang
  • Dongxiao Yu
چکیده

Topology control is a fundamental issue in wireless ad hoc and sensor networks. Due to intrinsic characteristic of flatness, hierarchical topology can achieve the scalability and efficiency of a wireless network. To solve this problem, one can construct a virtual backbone network by using a connected dominating (CDS) set of a wireless network. In past few years, efficiently and fast construct a CDS in a wireless network as a virtual backbone has been the main research problem in hierarchical topology control. In this paper, we give a comprehensive survey for CDSs and related problems with various network models and specific applications. To conclude, some open problems and interesting issues in this field are proposed. 2012 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congestion Control Approaches Applied to Wireless Sensor Networks: A Survey

Wireless Sensor Networks (WSNs) are a specific category of wireless ad-hoc networks where their performance is highly affected by application, life time, storage capacity, processing power, topology changes, the communication medium and bandwidth. These limitations necessitate an effective data transport control in WSNs considering quality of service, energy efficiency, and congestion control. ...

متن کامل

A Novel Comprehensive Taxonomy of Intelligent-Based Routing Protocols in Wireless Sensor Networks

Routing in ad-hoc networks, specifically intelligent-based ones, is a highly interested research topic in recent years. Most of them are simulation-based study. Large percentages have not even mentioned some of the fundamental parameters. This strictly reduces their validity and reliability. On the other hand, there is not a comprehensive framework to classify routing algorithms in wireless sen...

متن کامل

Computing Connected Dominated Sets with Multipoint Relays

Multipoint relays o er an optimized way of ooding packets in a radio network. However, this technique requires the last hop knowledge: to decide wether or not a ooding packet is retransmitted, a node needs to know from which node the packet was received. When considering broadcasting at IP level, this information may be di cult to obtain. We thus propose a scheme for computing an optimized conn...

متن کامل

An Efficient Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks

Connected dominating set (CDS) problem in unit disk graph has signi£cant impact on an ef£cient design of routing protocols in wireless sensor networks, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, a simple and ef£cient heuristic method is proposed fo...

متن کامل

Iterative Local Solutions for Connected Dominating Sets in Ad Hoc Wireless Networks

In this paper, we propose a general framework of the iterative local solution (ILS) for computing a connected dominating set (CDS) in ad hoc wireless networks, which include mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). This approach uses an iterative application of a selected local solution. Each application of the local solution enhances the result obtained from the pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Communications

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2013